Boolean Algebra


Q41.

What is the minimal form of the Karnaugh map shown below? Assume that X denotes a don't care term.
GateOverflow

Q42.

The dual of a Boolean function F(x_{1},x_{2},...,x_{n}, +, \cdot , ' ) , written as F^{D}, is the same expression as that of F with + and \cdot swapped. F is said to be self-dual if F=F^{D}. The number of self-dual functions with n Boolean variables is
GateOverflow

Q43.

The truth table represents the Boolean function
GateOverflow

Q44.

Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete ?
GateOverflow

Q45.

Let \oplus denote the Exclusive OR (XOR) operation. Let '1' and '0' denote the binary constants. Consider the following Boolean Algebra for F over two variables P and Q. F(P,Q)=((1\oplus P)\oplus (P\oplus Q)) \oplus ((P\oplus Q) \oplus (Q\oplus 0)) The equivalent expression for F is
GateOverflow